Axiomatics for implication.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Categorical Axiomatics for Bisimulation

We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on processes, such as nondeterministic sum, prefixing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T . We may define the notion of open map for any such 2-mona...

متن کامل

Quantum Axiomatics

We present an axiomatic and operational theory of quantum mechanics. The theory is founded on the axiomatic and operational approach started in Geneva mainly by Constantin Piron and his students and collaborators and developed further in Brussels by myself and different students and collaborators. A physical entity, which a priori can be a classical entity or a quantum entity or a combination o...

متن کامل

An axiomatics for categories of coalgebras

We give an axiomatic account of what structure on a category C and an endofunctor H on C yield similar structure on the category H Coalg of H-coalgebras. We give conditions under which completeness, cocompleteness, symmetric monoidal closed structure, local presentability, and subobject classi ers lift. Our proof of the latter uses a general result about the existence of a subobject classi er i...

متن کامل

The development of Euclidean axiomatics

The paper lists several editions of Euclid’s Elements in the Early Modern Age, giving for each of them the axioms and postulates employed to ground elementary mathematics.

متن کامل

Axiomatics for Data Refinement in Call by Value Programming Languages

We give a systematic category theoretic axiomatics for modelling data re nement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational -calculus, such as FPC and languages for modelling nondeterminism, and extensions of the rst order fragment of the computational -calculus, such as a CPS language. We give a category theoretic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1979

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093882405